package structures;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

public class CrossState {
	private State fState;
	private State sState;
	private int y;
	private Map<CrossState, Set<String>> edges;
	
	public CrossState(State fState, State sState, int y){
		this.fState = fState;
		this.sState = sState;
		this.y = y;
		edges = new HashMap<CrossState, Set<String>>();
	}
	
	public void addEdge(CrossState endState, String value){
		if (!edges.containsKey(endState)){
			edges.put(endState, new HashSet<String>());
		}
		edges.get(endState).add(value);
	}

	public State getfState() {
		return fState;
	}
	public State getsState() {
		return sState;
	}
	public int getY() {
		return y;
	}
	public Map<CrossState, Set<String>> getEdges() {
		return edges;
	}
}
